Improving function filtering for computationally demanding DCOPs
نویسندگان
چکیده
In this paper we focus on solving DCOPs in computationally demanding scenarios. GDL optimally solves DCOPs, but requires exponentially large cost functions, being impractical in such settings. Function filtering is a technique that reduces the size of cost functions. We improve the effectiveness of function filtering to reduce the amount of resources required to optimally solve DCOPs. As a result, we enlarge the range of problems solvable by algorithms employing function filtering.
منابع مشابه
Multi-Agent Coordination: DCOPs and Beyond
Distributed constraint optimization problems (DCOPs) are a model for representing multi-agent systems in which agents cooperate to optimize a global objective. The DCOP model has two main advantages: it can represent a wide range of problem domains, and it supports the development of generic algorithms to solve them. Firstly, this paper presents some advances in both complete and approximate DC...
متن کاملCommunication-constrained DCOPs: message approximation in GDL with function filtering
In this paper we focus on solving DCOPs in communication constrained scenarios. The GDL algorithm optimally solves DCOP problems, but requires the exchange of exponentially large messages which makes it impractical in such settings. Function filtering is a technique that alleviates this high communication requirement while maintaining optimality. Function filtering involves calculating approxim...
متن کاملImproving k-Nearest Neighbor Rule: Using Geometrical Neighborhoods and Manifold-based metrics
Sample weighting and variations in neighborhood or data-dependent distance metric definitions are three principal directions considered for improving k-NN classification technique. Recently, manifold-based distance metrics attracted considerable interest and computationally less demanding approximations are developed. However, a careful comparison of these alternative approaches is missing. In ...
متن کاملMetaheuristics for dynamic combinatorial optimization problems
Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints may change over time, and so solving DCOPs is a challenging task. Metaheuristics are a good choice of tools to tackle DCOPs because many metaheuristics are inspired by natu...
متن کاملA Dynamic Programming-Based MCMC Framework for Solving DCOPs with GPUs
The field of Distributed Constraint Optimization (DCOP) has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent coordination. Nevertheless, solving DCOPs is computationally challenging. Thus, in large scale, complex applications, incomplete DCOP algorithms are necessary. Recently, researchers have introduced a promising class of incomple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011